Computing zero-dimensional tropical varieties via projections
نویسندگان
چکیده
Abstract We present an algorithm for computing zero-dimensional tropical varieties using projections. Our main tools are fast monomial transforms of triangular sets. Given a Gröbner basis, we prove that our requires only polynomial number arithmetic operations, and, ideals in shape position, show its timings compare well against univariate factorization and backsubstitution. conclude the complexity positive-dimensional via traversal complex is dominated by walk.
منابع مشابه
Computing Tropical Varieties over Fields with Valuation
We show how tropical varieties of ideals I E K[x] over a field K with non-trivial valuation can always be traced back to tropical varieties of ideals π−1I E RJtK[x] over some dense subring R in its ring of integers. Moreover, for homogeneous ideals, we present algorithms on how the latter can be computed in finite time, provided that π−1I is generated by elements in R[t, x]. While doing so, we ...
متن کاملCocycles on Tropical Varieties via Piecewise Polynomials
We use piecewise polynomials to define tropical cocycles generalising the well-known notion of Cartier divisors to higher codimensions. We also introduce an intersection product of cocycles with tropical cycles and prove that this gives rise to a Poincaré duality in some cases.
متن کاملEquations of Tropical Varieties
We introduce a scheme-theoretic enrichment of the principal objects of tropical geometry. Using a category of semiring schemes, we construct tropical hypersurfaces as schemes over idempotent semirings such as T = (R∪{−∞},max,+) by writing them as solution sets to explicit systems of tropical equations that are uniquely determined by tropical linear algebra. We then define a tropicalization func...
متن کاملOn the complexity of computing with zero-dimensional triangular sets
We generalize Kedlaya and Umans’ modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead expone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Complexity
سال: 2022
ISSN: ['1016-3328', '1420-8954']
DOI: https://doi.org/10.1007/s00037-022-00222-9